Time - Varying K Shortest Paths
نویسنده
چکیده
منابع مشابه
Approximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملGlow discharge in microfluidic chips for visible analog computing.
Here we present a novel visible analog computing approach for solving a wide class of shortest path problems. Using a microfluidic chip for computation, based on the lighting up of a glow discharge, the solution to maze search problems, the solution of a network shortest path and k-shortest paths problems and the practical application of finding the shortest paths between several landmarks from...
متن کاملFinding the Shortest Path in Dynamic Network using Labeling Algorithm
This study concerns the problem of finding shortest paths from one node to all other nodes in networks for which arc costs can vary with time, each arc has a transit time and parking with a corresponding time-varying cost is allowed at the nodes. it show that this problem is equivalent to a classical shortest path problem in a timeexpanded network. The label correcting algorithm is used for fin...
متن کاملAn efficient time and space K point-to-point shortest simple paths algorithm
We address the problem identifying the K best point-to-point simple paths connecting a given pair of nodes in a directed network with arbitrary lengths. The main result in this paper is the proof that a path tree containing the kth point-to-point shortest simple path can be obtained by using one of the previous (k-1) path trees containing each one of the previous (k-1) best point-to-point short...
متن کاملFinding the k Shortest Paths in
A concurrent-read exclusive-write PRAM algorithm is developed to nd the k shortest paths between pairs of vertices in an edge-weighted directed graph. Repetitions of vertices along the paths are allowed. The algorithm computes an implicit representation of the k shortest paths to a given destination vertex from every vertex of a graph with n vertices and m edges, using O(m + nk log 2 k) work an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993